Coding and Decoding Schemes for MSE and Image Transmission

In this work we explore possibilities for coding and decoding tailor-made for mean squared error evaluation of error in contexts such as image transmission. To do so, we introduce a loss function that expresses the overall performance of a coding and decoding scheme for discrete channels and that exchanges the usual goal of minimizing the error probability to that of minimizing the expected loss. In this environment we explore the possibilities of using ordered decoders to create a message-wise unequal error protection (UEP), where the most valuable information is protected by placing in its proximity information words that differ by a small valued error. We give explicit examples, using scale-of-gray images, including small-scale performance analysis and visual simulations for the BSMC.Comment: Submitted to IEEE Transactions on Information Theor

Error-block codes and poset metrics

Let P = ({1, 2,..., n}, <=) be a poset, let V-1, V-2,...,V-n, be a family of finite-dimensional spaces over a finite field F-q and let V = V-1 circle plus V-2 circle plus ... V-n. In this paper we endow V with a poset metric such that the P-weight is constant on the non-null vectors of a component V-i, extending both the poset metric introduced by Brualdi et al. and the metric for linear error-block codes introduced by Feng et al.. We classify all poset block structures which admit the extended binary Hamming code [8; 4; 4] to be a one-perfect poset block code, and present poset block structures that turn other extended Hamming codes and the extended Golay code [24; 12; 8] into perfect codes. We also give a complete description of the groups of linear isometrics of these metric spaces in terms of a semi-direct product, which turns out to be similar to the case of poset metric spaces. In particular, we obtain the group of linear isometrics of the error-block metric spaces.Let P = ({1, 2,..., n}, <=) be a poset, let V-1, V-2,...,V-n, be a family of finite-dimensional spaces over a finite field F-q and let V = V-1 circle plus V-2 circle plus ... V-n. In this paper we endow V with a poset metric such that the P-weight is cons2195111FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOsem informaçã

Symmetry groups of Rosenbloom-Tsfasman spaces

Let F(q)(m.n) he the vector space of m . n-tuples over a finite field Fit and P = {1, 2,..., m - n} a poset that is the finite union of In disjoint chains of length it. We consider on F(q)(m.n) the poset-metric d(p) introduced by Rosenbloom and Tsfasman. In this paper, we give a complete description of the symmetry group of the metric space (V, d(p)). (C) 2008 Elsevier B.V. All rights reserved.Let F(q)(m.n) he the vector space of m . n-tuples over a finite field Fit and P = {1, 2,..., m - n} a poset that is the finite union of In disjoint chains of length it. We consider on F(q)(m.n) the poset-metric d(p) introduced by Rosenbloom and Tsfasman.3094763771FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOsem informaçãoThe authors would like to thank the anonymous referee for valuable remarks which led to sensible improvements in the text and in the proof

Coding in the Presence of Semantic Value of Information: Unequal Error Protection Using Poset Decoders

In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual goal of minimizing the error probability to that of minimizing the expected loss. In this environment we explore the possibilities of using poset-decoders to make a message-wise unequal error protection (UEP), where the most valuable information is protected by placing in its proximity information words that differ by small valued information. Similar definitions and results are shortly presented also for signal constellations in Euclidean space

Relacionamentos entre Sistemas de Controle e Alinhamento Estratégico: um Estudo na Itaipu Binacional

Several papers have connected management controls to strategic commitment, innovation, and corporate governance, among other organizational outcomes. There are few studies that relate the levers of control framework proposed by Simons (1995) to strategic alignment. This paper aims to evaluate the relationships between Simons' strategic levers of control with the vertical strategic alignment at Itaipu Binacional. Data collected through a survey of 341 respondents and analysed through structural equation modelling by the Partial Least Squares (PLS) method revealed that the levers of control are associated, exerting a positive influence, with the strategic alignment, with diagnostic, beliefs, and interactive systems showing significant statistical associations.Diversos estudos têm vinculado controles de gestão ao comprometimento estratégico, inovação, governança corporativa, dentre outros outcomes organizacionais. No entanto são escassos os estudos que relacionam o modelo das alavancas de controle estratégico (MAC) proposto por Simons (1995) ao alinhamento estratégico. O presente estudo objetiva avaliar os relacionamentos entre as alavancas de controle estratégico de Simons (1994) com o alinhamento estratégico vertical na Itaipu Binacional. Dados coletados por meio de um survey junto a 341 respondentes e analisados por meio da modelagem de equações estruturais pelo método PLS (Partial Least Squares) revelaram que as alavancas (MAC) se associam, exercendo influência positiva, com o alinhamento estratégico vertical, com destaque para os sistemas diagnóstico, de crenças e interativo, que produziram associações estatísticas significativas

Edificios de tits, aplicações a teoria dos codigos e sistemas geometricos

Orientador : Marcelo FirerDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação CientificaMestradoMestre em Matemátic

A low complexity coding and decoding strategy for the quadratic Gaussian CEO problem

FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOWe consider the quadratic Gaussian CEO problem, where the goal is to estimate a measure based on several Gaussian noisy observations which must be encoded and sent to a centralized receiver using limited transmission rate. For real applications, besides minimizing the average distortion, given the transmission rate, it is important to take into account memory and processing constraints. Considering these motivations, we present a low complexity coding and decoding strategy, which exploits the correlation between the measurements to reduce the number of bits to be transmitted by refining the output of the quantization stage. The CEO makes an estimate using a decoder based on a process similar to majority voting. We derive explicit expression for the CEO's error probability and compare numerical simulations with known achievability results and bounds. (C) 2016 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.We consider the quadratic Gaussian CEO problem, where the goal is to estimate a measure based on several Gaussian noisy observations which must be encoded and sent to a centralized receiver using limited transmission rate. For real applications, besides minimizing the average distortion, given the transmission rate, it is important to take into account memory and processing constraints. Considering these motivations, we present a low complexity coding and decoding strategy, which exploits the correlation between the measurements to reduce the number of bits to be transmitted by refining the output of the quantization stage. The CEO makes an estimate using a decoder based on a process similar to majority voting. We derive explicit expression for the CEO's error probability and compare numerical simulations with known achievability results and bounds.3533643656FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOFAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO2013/25977-